منابع مشابه
Triple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کاملMaximal Subgroups of Finite Groups
What ingredients are necessary to describe all maximal subgroups of the general finite group G? This paper is concerned with providing such an analysis. A good first reduction is to take into account the first isomorphism theorem, which tells us that the maximal subgroups containing a given normal subgroup N of G correspond, under the natural projection, to the maximal subgroups of the quotient...
متن کاملMaximal Subgroups of Symmetric Groups
A theorem of O’Nan and Scott [6]; [2, Chapter 4] restricts the possibilities for maximal subgroups of finite symmetric groups: they are of six types of which the first four are explicitly known, the fifth involves a finite simple group, and the sixth an action of a simple group. This result, in conjunction with the Classification of Finite Simple Groups, has a number of consequences. In particu...
متن کاملRank 3 Permutation Characters and Maximal Subgroups
Let G be a transitive permutation group acting on a finite set E and let P be the stabilizer in G of a point in E. We say that G is primitive rank 3 on E if P is maximal in G and P has exactly three orbits on E. For any subgroup H of G, we denote by 1H the permutation character (or permutation module) over C of G on the cosets G/H. Let H and K be subgroups of G. We say 1H 6 1 G K if 1 G K − 1 G...
متن کاملComputing characters of groups with central subgroups
The so-called Burnside-Dixon-Schneider (BDS) method currently used as the default method of computing character tables in GAP for groups which are not solvable is often inefficient in dealing with groups with large centres. If G is a finite group with centre Z and λ a linear character of Z, then we describe a method of computing the set Irr(G,λ) of irreducible characters χ of G whose restrictio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1996
ISSN: 0021-8693
DOI: 10.1006/jabr.1996.0242